A bounded sequence of bitransitive and capture Sierpiński curve Julia sets for 3-circle inversions
نویسندگان
چکیده
We demonstrate the existence of a bounded sequence infinitely many parameter values for $3$-circle inversion that lead to Sierpiński curve Julia sets. This consists alternating that, although they all yield
منابع مشابه
Sierpinski Carpets as Julia sets for Imaginary 3-Circle Inversions
sends the point z ∈ C to its inversion image about the circle of radius r ∈ R centered at the point a ∈ C. Dynamically, this map is not interesting since iterating twice yields the identity mapping. Using three circles we invert a point z about each circle and form a new map by sending z to the arithmetic mean of the three inversion images. We refer to this as inverting z about the three circle...
متن کاملSierpiński curve Julia sets for quadratic rational maps
We investigate under which dynamical conditions the Julia set of a quadratic rational map is a Sierpiński curve.
متن کاملSierpinski-curve Julia sets and singular perturbations of complex polynomials
In this paper we consider the family of rational maps of the complex plane given by z2 + λ z2 where λ is a complex parameter. We regard this family as a singular perturbation of the simple function z2. We show that, in any neighborhood of the origin in the parameter plane, there are infinitely many open sets of parameters for which the Julia sets of the correspondingmaps are Sierpinski curves. ...
متن کاملFUZZY BOUNDED SETS AND TOTALLY FUZZY BOUNDED SETS IN I-TOPOLOGICAL VECTOR SPACES
In this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. Thena relation between totally fuzzy bounded sets and N-compactness is discussed.Finally, a geometric characterization for fuzzy totally bounded sets in I- topologicalvector spaces is derived.
متن کاملComputability of Julia Sets
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2023
ISSN: ['0016-2736', '1730-6329']
DOI: https://doi.org/10.4064/fm166-4-2023